package com.fbli;
//测试生产者消费者模型，利用缓冲区解决 管程法
//生产者，消费者，产品，缓冲区
public class TestPC {
    public static void main(String[] args) {
        SynContainer container = new SynContainer();
        new Product(container).start();
        new Consumer(container).start();
    }
}
//生产者
class Product extends Thread{
    SynContainer container;
    public Product(SynContainer container) {
        this.container=container;
    }
    //生产

    @Override
    public void run() {
        for (int i = 0; i < 100; i++) {
            container.push(new Chicken(i));
            System.out.println("生产了第"+i+"只鸡");
        }
    }
}
//消费者
class Consumer extends Thread{
    SynContainer container;
    public Consumer(SynContainer container) {
        this.container=container;
    }

    @Override
    public void run() {
        for (int i = 0; i < 100; i++) {
            System.out.println("消费了第"+container.pop().id+"只鸡");
        }
    }
}
//产品
class Chicken{
    int id;//产品编号
    public Chicken(int id) {
        this.id = id;
    }
}
//缓冲区
class SynContainer{
    //容器大小
    Chicken[] chickens=new Chicken[10];
    //容器计数器
    int count=0;
    //生产者生产产品
    public synchronized void push(Chicken chicken){
        //如果容器满了就需要等待消费
        if(count>=chickens.length){
            //等待消费
            try {
                this.wait();
            }catch (InterruptedException e){
                e.printStackTrace();
            }

        }
        //如果没有满，就向容器内丢入产品
            chickens[count]=chicken;
            count++;
            //可以通知消费者消费了
            this.notifyAll();
    }
    //消费者消费产品
    public synchronized Chicken pop(){
        if (count==0){
            //等待消费者生产
            try {
                this.wait();
            }catch (InterruptedException e){
                e.printStackTrace();
            }
        }
        count--;
        Chicken chicken=chickens[count];
        //通知生产者生产
        this.notifyAll();
        return chicken;



    }
}